Lattice Codes Can Achieve Capacity On The AWGN Channel - Information Theory, IEEE Transactions on
نویسندگان
چکیده
It is shown that lattice codes can achieve capacity on the additive white Gaussian noise channel. More precisely, for any rate R less than capacity and > 0, there exists a lattice code with rate no less than R and average error probability upper-bounded by : These lattice codes include all points of the (translated) lattice within the spherical bounding region (not just the ones inside a thin spherical shell).
منابع مشابه
Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal optimal code
It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position modulation that is sequential in nature — bits can be “streamed across” without having to buffer up blocks of bits at the transmitter. ML decoding results in an expon...
متن کاملAlgebraic lattice codes for linear fading channels
In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and geometry of numbers. One of the most striking examples is the connection between classical lattice sphere packing and the capacity of the AWGN channel. The main ...
متن کاملImproving the Performance of Nested Lattice Codes Using Concatenation
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of this short note is to point out that by concatenating a capacity-achieving nested lattice code with a suitable highrate linear code over an appropriate finite field, we can achieve the capacity of the AWGN channel with...
متن کاملSphere-bound-achieving coset codes and multilevel coset codes
A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that...
متن کاملError-correcting codes for authentication and subliminal channels
The application of coding theory to security scenarios is studied. Authentication systems are introduced that are based on algebraic codes and provide high protection against an intruder's impersonation and substitution attacks. It is shown that a subliminal channel can be embedded into these systems and that there is a trade-off between the authentication capability, subliminal capacity and er...
متن کامل